On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs
نویسندگان
چکیده
In this paper we consider the question of determining the maximum number of edges in a hamiltonian graph of order n that contains no 2-factor with more than one cycle, that is, 2-factor hamiltonian graphs. We obtain exact results for both bipartite graphs, and general graphs, and construct extremal graphs in each case. Mathematics Subject Classification (2000). Primary 05C45; Secondary 05C38.
منابع مشابه
The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملEdge bounds in nonhamiltonian k-connected graphs
Let G be a k-connected graph of order n with |E(G)|>(n−k 2 )+ k2. Then for (k = 1, n 3), (k = 2, n 10), and (k = 3, n 16), G is hamiltonian. The bounds are tight and for k = 1, (k = 2, n 12), and (k = 3, n 18) the extremal graphs are unique. A general bound will also be given for the number of edges in a nonhamiltonian k-connected graph, but the bound is not tight. © 2006 Elsevier B.V. All righ...
متن کاملExtremal P4-stable graphs
Call a graph G k-stable (with respect to some graph H) if, deleting any k edges of G, the remaining graph still contains H as a subgraph. For a fixed H, the minimum number of edges in a k-stable graph is denoted by S(k). We prove general bounds on S(k) and compute the exact value of the function S(k) for H = P4. The main result can be applied to extremal k-edge-hamiltonian hypergraphs.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کامل